Stereo matching based on nonlinear diffusion with disparity-dependent support weights
نویسنده
چکیده
In stereo matching, computing matching cost or similarity between pixels across different images is one of the main steps to get reliable results. More accurate and robust matching cost can be obtained by aggregating per-pixel raw matching cost within the predefined support area. Here, it is very important to aggregate only valid supports from neighbouring pixels. However, unfortunately, it is hard to evaluate the validity of the supports from neighbours beforehand. To resolve this problem, we propose a new method for the matching cost computation based on the nonlinear diffusion. The proposed method helps to aggregate truly valid supports from neighbouring pixels and does not require any local stopping criterion of iteration. This is achieved by using disparity-dependent support weights that are also updated at every iteration. As a result, the proposed method combined with a simple winner-take-all disparity selection method yields good results not only in homogeneous areas but also in depth discontinuity areas as the iteration goes on without the critical degradation of performance. In addition, when combined with global methods for the disparity selection, the proposed method truly improve the matching performance.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملSpatiotemporal Stereo Matching with 3D Disparity Profiles
Adaptive support weights and over-parameterized disparity estimation truly improve the accuracy of stereo matching by enabling window-based similarity measures to handle depth discontinuities and non-fronto-parallel surfaces more effectively. Nevertheless, a disparity map sequence obtained in a frame-by-frame manner still tends to be inconsistent even with the use of state-of-the-art stereo mat...
متن کاملStereo correspondence based on curvelet decomposition, support weights, and disparity calibration
ibyendu Mukherjee uanghui Wang . M. Jonathan Wu niversity of Windsor epartment of Electrical and Computer Engineering 01 Sunset Avenue indsor, Ontario, N9B 3P4 Canada -mail: [email protected] Abstract. A novel multiresolution analysis-based stereo matching method using curvelets, support weights, and disparity calibration is proposed. By introducing curvelet decomposition, we obtain the curv...
متن کاملInformation permeability for stereo matching
A novel local stereo matching algorithm is introduced to address the fundamental challenge of stereo algorithms, accuracy and computational complexity dilemma. The time consuming intensity dependent aggregation procedure of local methods is improved in terms of both speed and precision. Providing connected 2D support regions, the proposed approach exploits a new paradigm, namely separable succe...
متن کاملReal-time Stereo Vision and Obstacle Location on single FPGA for Miniature Navigation
In this paper, we present a cooperative stereo vision algorithm with three cameras for dense disparity mapping and occlusion detection. Based on nonlinear iteration and multiple cameras, the disparity maps are smooth and the object boundaries are accurate. Occlusions for each stereo pair are detected effectively by examining the iterative inhibition and magnification of the matching evaluation....
متن کامل